package Demo1.tree;/*
 *@ 代阳敲的专属代码
 **/

public class Test {
    public static void main(String[] args) {
       BinaryTree tree = new BinaryTree();
       BinaryTree.Node root = tree.CreateTree();
//       tree.preOrder(root);
//       System.out.println("");
//        tree.inOrder(root);
//        System.out.println("");
//       tree.postOrder(root);
//        System.out.println("");
//        tree.SizeNode(root);
//        System.out.println(tree.size);
        //System.out.println(tree.SizeTree2(root));
//        tree.getLeafNodeCount(root);
//        System.out.println(tree.count);
//        System.out.println(tree.getLeafNodeCount2(root));
//        System.out.println(tree.getKLevelNodeCount(root,3));
//        System.out.println(tree.getHeight(root));
//        System.out.println(tree.getKLevelNodeCount(root,3));
        //System.out.println(tree.find(root,'C').data);
  //        tree.levelOrder(root);
        System.out.println(tree.isCompleteTree(root));
    }
}
